Notes from Raleigh, N C.

The Raleigh Game

We present a game on 3 piles of tokens, which is neither a generalization of Nim, nor of Wythoff’s game. Three winning strategies are given and validated. They are, respectively, recursive, algebraic and arithmetic in nature, and differ in their time and space requirements. The game is a birthday present for Ron Graham, but it would take too much time and space to explain why.

Service Notes, &c.

Network Embeddedness and the Retreat from Southern Vowels in Raleigh

The November Meeting in Raleigh

s of the papers presented follow below. Abstracts whose numbers are followed by the letter "t" were presented by title. Paper number 51 was read by Professor Rutledge. Professor J. W. Ellis was introduced by Dr. Goodner, Mr. McAuley by Professor Jones, Dr. Jaeger by Professor Cairns, Dr. Gordon and Mr. Capel by Professor Wallace, Mr. Pellicciaro and Dr. Shields by Professor Whyburn. ALGEBRA AND...

Notes on Big-n Problems

where α is a step size. If the gradient of f is Lipschitz-continuous with constant L, then using the step size α = 1/L guarantees that f(x) < f(x) (provided ∇f(x) 6= 0), and if f is convex that the distance to the optimal value f(x∗) as a function of k is O(1/k). Nesterov [1983] proposes a simple modification, referred to as the accelerated gradient method, that improves this to O(1/k), and und...